Structured Connectivity Augmentation

We initiate the algorithmic study of the following “structured augmentation” question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition of G and H with respect to injective mapping φ : V (H) → V (G) if every edge uv of F is either an edge of G, or φ−1(u)φ−1(v) is an edge of H. Thus F contains both G and H as subgraphs, and the edge set of F is the union of the edge sets of G and φ(H). We consider the following optimization problem. Given graphs G, H, and a weight function ω assigning non-negative weights to pairs of vertices of V (G), the task is to find φ of minimum weight ω(φ) = ∑ xy∈E(H) ω(φ(x)φ(y)) such that the edge connectivity of the superposition F of G and H with respect to φ is higher than the edge connectivity of G. Our main result is the following “dichotomy” complexity classification. We say that a class of graphs C has bounded vertex-cover number, if there is a constant t depending on C only such that the vertex-cover number of every graph from C does not exceed t. We show that for every class of graphs C with bounded vertex-cover number, the problems of superposing into a connected graph F and to 2-edge connected graph F , are solvable in polynomial time when H ∈ C. On the other hand, for any hereditary class C with unbounded vertex-cover number, both problems are NP-hard when H ∈ C. For the unweighted variants of structured augmentation problems, i.e. the problems where the task is to identify whether there is a superposition of graphs of required connectivity, we provide necessary and sufficient combinatorial conditions on the existence of such superpositions. These conditions imply polynomial time algorithms solving the unweighted variants of the problems.